A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity
نویسندگان
چکیده
This report proposes a simple modification of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for high dimensional objective functions, that reduces the internal time and space complexity from quadratic to linear. The covariance matrix is constrained to be diagonal and the resulting algorithm, sep-CMA-ES, samples each coordinate independently. Because the model complexity is reduced, the learning rate for the covariance matrix can be increased. Consequently, on essentially separable functions, sep-CMA-ES significantly outperforms CMA-ES. For dimensions larger than 100, even on the non-separable Rosenbrock function, the sep-CMA-ES needs fewer function evaluations than CMA-ES. Key-words: Evolution Strategy, Performance Assessment, Separability, Covariance Matrix Adaptation, Time Complexity in ria -0 02 70 90 1, v er si on 4 30 J un 2 00 8 Une Simple Modification dans CMA-ES pour une Complexité Spatiale et Temporelle Linéaire Résumé : Pas de résumé Mots-clés : Pas de motclef in ria -0 02 70 90 1, v er si on 4 30 J un 2 00 8 A simple modification in CMA-ES achieving linear complexity. 3
منابع مشابه
Main Vector Adaptation: A CMA Variant with Linear Time and Space Complexity
The covariance matrix adaptation (CMA) is one of the most powerful self adaptation mechanisms for Evolution Strategies. However, for increasing search space dimension N , the performance declines, since the CMA has space and time complexity O(N2). Adapting the main mutation vector instead of the covariance matrix yields an adaptation mechanism with space and time complexity O(N). Thus, the main...
متن کاملCMA-ES with Optimal Covariance Update and Storage Complexity
The covariance matrix adaptation evolution strategy (CMA-ES) is arguably one of the most powerful real-valued derivative-free optimization algorithms, finding many applications in machine learning. The CMA-ES is a Monte Carlo method, sampling from a sequence of multi-variate Gaussian distributions. Given the function values at the sampled points, updating and storing the covariance matrix domin...
متن کاملThe dithered signed-error constant modulus algorithm
Adaptive blind equalization has gained widespread use in communication systems that operate without training signals. In particular, the Constant Modulus Algorithm (CMA) has become a favorite of practitioners due to its LMS-like complexity and desirable robustness properties. The desire for further reduction in computational complexity has motivated signed-error versions of CMA, which have been...
متن کاملA High Performance Blind Adaptive Filtering Algorithm
Recently a dithered signed-error constant modulus algorithm (DSE-CMA) has been proposed for the purpose of low complexity implementation of constant modulus algorithm (CMA), which is widely used for blind adaptive filtering due to its LMS-like desirable robustness properties. Despite the fact that this algorithm has robustness properties closely resembling those of CMA, it is very slow in conve...
متن کاملTask Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008